The nurse rerostering problem: An explorative study
نویسندگان
چکیده
Oftentimes, hospitals encounter disruptions of nurse schedule due to unforeseen absence of nurses from their scheduled shifts. Known as the nurse rerostering problem, this problem is commonplace in most hospitals all over the world. In such uncertain environments, decision analysis need to reconstruct the roster, ensuring minimal changes on the original roster, subject to reported disruptions. Service quality, staffing requirements, management goals, as well as nurse preferences have to be satisfied as much as possible. The rerostering decisions taken have implications on staff morale, service quality, and costs incurred. Thus, the problem is of critical importance to the healthcare sector. This paper presents a chronological review of literature on nurse rerostering (rescheduling literature) from the year 2000 to 2016. The review critically analyses the nurse rerostering research activities over the years, the range of modelling approach used, the challenges and future research implications. The paper stimulates insightful thinking and research foci on topical issues in nurse rerostering which could be very helpful in developing appropriate decision support systems and strategies for nurse rescheduling.
منابع مشابه
Nurse rescheduling with shift preferences and minimal disruption
Hospital wards must be staffed 24 hours a day by a limited number of nurses. With a well documented shortage of nurses in many countries, effective rostering of nurse shifts is crucial. Recent research on nurse rostering has focused on creating flexible rosters that are attractive to nurses, with the joint aims of improving the quality of care and increasing staff retention. To achieve this, so...
متن کاملA Deterministic Approach to Nurse Rerostering Problem
When a nurse at a hospital is unable to be in charge of any of his/her assigned shifts, the roster should be rescheduled to cope with it, which is called nurse rerostering problem. In this problem, we are supposed to find a new one which is close to the given as well as satisfies all the constraints that it inherits from nurse scheduling problem which built the roster. It was proved NP-complete...
متن کاملSolving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
Nurse rerostering arises when at least one nurse announces that she will be unable to undertake the tasks previously assigned to her. The problem amounts to building a new roster that satisfies the hard constraints already met by the current one and, as much as possible, fulfils two groups of soft constraints which define the two objectives to be attained. A bi-objective genetic heuristic was d...
متن کاملAn acceleration of the algorithm for the nurse rerostering problem on a graphics processing unit
This paper deals with the Nurse Rerostering Problem (NRRP) performed by a parallel algorithm on a Graphics Processing Unit (GPU). This problem is focused on rescheduling of human resources in healthcare, when a roster is disrupted by unexpected circumstances. Our aim is to resolve NRRP in a parallel way to shorten the needed computational time in comparison to already known algorithms. The desi...
متن کاملJointly rostering, routing, and rerostering for home health care services: A harmony search approach with genetic, saturation, inheritance, and immigrant schemes
In home health care (HHC) services, nurses or professional caregivers are dispatched to patients’ homes to provide medical care services, such that each patient can stay at home to be treated periodically. The HHC problem consists of the nurse rostering problem (NRP) and the vehicle routing problem with time windows (VRPTW), both of which are NP-hard problems, which are harder or equal to the h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017